Magnetic models on Apollonian networks.

نویسندگان

  • Roberto F S Andrade
  • Hans J Herrmann
چکیده

Thermodynamic and magnetic properties of Ising models defined on the triangular Apollonian network are investigated. This and other similar networks are inspired by the problem of covering a Euclidian domain with circles of maximal radii. Maps for the thermodynamic functions in two subsequent generations of the construction of the network are obtained by formulating the problem in terms of transfer matrices. Numerical iteration of this set of maps leads to very precise values for the thermodynamic properties of the model. Different choices for the coupling constants between only nearest neighbors along the lattice are taken into account. For both ferromagnetic and antiferromagnetic constants, long-range magnetic ordering is obtained. With exception of a size-dependent effective critical behavior of the correlation length, no evidence of asymptotic criticality was detected.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

. so c - ph ] 3 1 O ct 2 00 6 Vertex labeling and routing in expanded Apollonian networks

We present a family of networks, expanded deterministic Apollonian networks, which are a generalization of the Apollonian networks and are simultaneously scale-free, small-world, and highly clustered. We introduce a labeling of their vertices that allows to determine a shortest path routing between any two vertices of the network based only on the labels.

متن کامل

High dimensional Apollonian networks

We propose a simple algorithm which produces high dimensional Apollonian networks with both small-world and scale-free characteristics. We derive analytical expressions for the degree distribution, the clustering coefficient and the diameter of the networks, which are determined by their dimension. PACS numbers: 89.75.Hc, 89.75.Da, 89.20.Hh High dimensional Apollonian networks 2

متن کامل

Connections Between Several Distributions of Scale-free Networks

Abstract –In our empirical works, we find that there exists the equivalency of the cumulative degree distribution and edge-cumulative distribution. Furthermore, we employ three network models of the recursive graphs, Sierpinksi networks and Apollonian networks to verify our conjecture: Both the cumulative degree distribution and the edge-cumulative distribution are equivalent to each other in d...

متن کامل

Vertex labeling and routing in expanded Apollonian networks

We present a family of networks, expanded deterministic Apollonian networks, which are a generalization of the Apollonian networks and are simultaneously scale-free, small-world, and highly clustered. We introduce a labeling of their nodes that allows one to determine a shortest path routing between any two nodes of the network based only on the labels. PACS numbers: 02.10.Ox, 89.20.Ff, 89.75.D...

متن کامل

Apollonian networks: simultaneously scale-free, small world, euclidean, space filling, and with matching graphs.

We introduce a new family of networks, the Apollonian networks, that are simultaneously scale-free, small-world, Euclidean, space filling, and with matching graphs. These networks describe force chains in polydisperse granular packings and could also be applied to the geometry of fully fragmented porous media, hierarchical road systems, and area-covering electrical supply networks. Some of the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Physical review. E, Statistical, nonlinear, and soft matter physics

دوره 71 5 Pt 2  شماره 

صفحات  -

تاریخ انتشار 2005